Domination and leaf density in graphs
نویسنده
چکیده
The domination number γ(G) of a graph G is the minimum cardinality of a subset D of V (G) with the property that each vertex of V (G) − D is adjacent to at least one vertex of D. For a graph G with n vertices we define ǫ(G) to be the number of leaves in G minus the number of stems in G, and we define the leaf density ζ(G) to equal ǫ(G)/n. We prove that for any graph G with no isolated vertex, γ(G) ≤ n(1−ζ(G))/2 and we characterize the extremal graphs for this bound. Similar results are obtained for the total domination number. The 2-partition domination number γ(G, π2) of a graph G and a 2-partition π2 = {V1, V2} of V (G) is defined by the sum γ(G) + γG(V1)+γG(V2). We prove that for any graph G with no isolated vertex and any 2-partition π2 of V (G), γ(G, π2) ≤ 3n(1−ζ(G))/2 and we characterize the extremal graphs. For graphs with leaf density ζ > 1/6, this new bound is an improvement of the bound given by B. Hartnell and P. D. Vestergaard [J. Combin. Math. Combin. Comput. 2003, Aug., 46].
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملDomination parameters of Cayley graphs of some groups
In this paper, we investigate domination number, $gamma$, as well as signed domination number, $gamma_{_S}$, of all cubic Cayley graphs of cyclic and quaternion groups. In addition, we show that the domination and signed domination numbers of cubic graphs depend on each other.
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملTwin minus domination in directed graphs
Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 25 شماره
صفحات -
تاریخ انتشار 2005